Method and Apparatus for Sending Authentication Request Message in a Social Network

ABSTRACT

The present disclosure describes a method and an apparatus for sending an authentication request message in a social network. In order to resolve the problem that there are few parameters to be relied on when a user authenticates a request seeking to establish a social network relationship with the user, the method disclosed by the present disclosure includes: a social network server that, after obtaining an authentication request message sent by a first client to a second client to request to establish a social network relationship, modifies the first client&#39;s identification information in the first authentication request message to a third client&#39;s identification information to obtain a second authentication request message. The third client has a social network relationship with the first client and also has a direct social network relationship with the second client. The second authentication request message is sent to the second client. As the third client&#39;s identification information is used as identification information of a sending party in the second authentication request message that is sent to the second client, there will be more parameters for use when the second client verifies the request to establish the social network relationship.

CROSS REFERENCE TO RELATED PATENT APPLICATIONS

This application is a continuation application which claims priority to commonly assigned, co-pending U.S. patent application Ser. No. 12/867,858, filed Aug. 16, 2010, which is the national stage application of an international patent application PCT/US10/33900, filed May 6, 2010, which claims priority from Chinese Patent Application No. 200910147250.7, filed Jun. 12, 2009, entitled “METHOD AND APPARATUS FOR SENDING AUTHENTICATION REQUEST MESSAGE IN A SOCIAL NETWORK,” which applications are hereby incorporated in their entirety by reference.

TECHNICAL FIELD

The present disclosure relates to internet technology field and, more particularly, to a method and apparatus for sending an authentication request message in a social network.

BACKGROUND

In the current Internet-based environment, the social network formed by online netizens has evolved beyond the simple connection between individual subscribers, and involves one-to-many and many-to-many relationships. A social network includes online users and their related networks, such as instant message (IM) systems and Internet SNS (Social Network Service) communities based on WEB2.0. Taking an IM application for example, before its subscribers intercommunicate and exchange information through their respective IM subscriber ends, the IM application typically requires certain bilateral social network relationship between the subscribers who are about to communicate with each other, in order to accelerate orientation of communicating parties and prevent subscribers from sending spam information and/or harassing messages. With the current IM software technology, if user A initiates a communication with user B who is not on a list of user A's social network relationships, or if user A requests to establish a certain social relationship with user B, user A sends an authentication request message to user B through a server system. (The authentication request message includes a textual description and user A's identification information. The identification information is used to identify a sender who sends the authentication request message. The textual description is used to express a request to establish a social network relationship with user B.) User B decides whether to establish the social network relationship with user A or not based on the authentication request message. If user B agrees then a social network relationship between user A and user B is established. If user B does not agree then a social network relationship between user A and user B cannot be established. Only after user B verifies user A's request, can user A find user B in user A's list of social network relationships, and begin to communicate and chat with user B.

When user A requests to become a user who has certain social network relationship with user B, user B can only determine, through user A's authentication request message, whether or not to establish the social network relationship with user A. Thus, under the current technologies, when user B verifies the request to establish a social network relationship with him/her, user B can only depend on the information in user A's textual description in the authentication request message forwarded by the server system to user B to make the determination. Accordingly, user B faces a problem of low authentication reliability.

SUMMARY

In order to resolve the low reliability problem when users verify requests to establish a social network relationship, the present disclosure provides a method for sending an authentication request message in a social network. The method includes actions described below.

A social network server receives a first authentication request message from a first client to establish the social network relationship with a second user. The first authentication request message includes identification information of the first client.

The social network server modifies the identification information of first client to identification information of a third client to obtain a second authentication request message, where the third client has a social network relationship with the first client and also has a direct social network relationship with the second client.

The social networking server sends the second authentication request message to the second client.

The present disclosure also provides an apparatus for sending an authentication request message in a social network. The apparatus includes components described below.

A receiving module—The receiving module receives a first authentication request message sent by a first client to request to establish a social network relationship with a second client. The first authentication request message includes a first client's identification information identifying a sender.

A modification module—The modification module modifies the first client's identification information to third client identification information to obtain a second authentication request message. The third client has a social network relationship with the first client and also has a direct social network relationship with the second client.

A first sending module—The first sending module sends the second authentication request message to the second client.

As shown from the above implementations, because the third client identification information is used for identification of the sending party in the second authentication request message sent to the second client, the second client can rely on more parameters when verifying the request to establish new social network relationship.

DESCRIPTIONS OF DRAWINGS

FIG. 1 shows a flowchart of a method in accordance with a first exemplary embodiment of the present disclosure.

FIG. 2 shows a social network chain diagram in accordance with the first exemplary embodiment of the present disclosure.

FIG. 3 shows a structure diagram of an apparatus in accordance with a second exemplary embodiment of the present disclosure.

DETAILED DESCRIPTION

A first exemplary embodiment disclosed by the present disclosure is a method 100 for sending an authentication request message in a social network. A flowchart of the method 100 is shown in FIG. 1. The method includes actions as described below.

At 101, client A sends an authentication request message to client E through the social network server in order to establish a social network relationship with client E. The authentication request message sent by client A includes client A's identification information A.

At 102, a social network server, after obtaining the authentication request message, determines that clients who have direct social network relationships with client E include client B, client C, and client D.

At 103, the social network server determines that clients who have direct relationships with client A include client B and client C.

At 104, the social network server, based on a preset rule, selects client B from client B and client C, and obtains client B's identification information B.

At 105, the social network server modifies the identification information A that is included in the authentication request message sent by client A into identification information B.

At 106, the social network server sends to client E the authentication request message with the modified of identification information.

In the step 101, client A and client E can be clients in an IM system, or clients in a web 2.0 based Internet SNS. As an example of IM tools, if a user 1 uses client A to communicate with a user 2 who is not on a list of user 1's social network relationship, or if user 1 requests to establish a certain social network relationship with user 2, then user 1 first inputs a textual description in a dialog box provided by client A to express his/her request to establish the social network relationship with user 2. Afterwards, together with the identification information of user 1, the textual description input by user 1 becomes part of the authentication request message to be sent to user 2 through client A. User 2 receives the authentication request message through client E.

Client E has a list of social network relationships. For example, the list of social network relationships in Table 1, shown below, has three client identifications and their corresponding social network relationship categories, indicating that client B, client C and client D have social network relationships with client E and that their social network relationship category is 1. For instance, a network social relationship category 1 represents a “good friend relationship.” Of course, depending on specific needs, client E can also have several lists of social network relationships, each representing an associated relationship between different client identifications and different social network relationship categories. For example, client E not only has Table 1 but also Table 2, as shown below. In Table 2, the social network relationship category is 2, indicative of an “acquaintance relationship.” Each client of the social network has stored a list similar to that of client E, which is used to store client identifications of clients who have social network relationship with this particular client, as well as corresponding social network relationship categories.

TABLE 1 Social Network Client identification Relationship Category B 1 C 1 D 1

TABLE 2 Social Network Client identification Relationship Category F 2 G 2

Based on the user's needs, client A sends, through the social network server, the authentication request message to client E to join Table 1. It is understood that the user's application needs may be different so that client A can also send to client E through the social network server the authentication request message to join Table 2. The authentication request message includes: identification information A, identification information E, and some textual description to request client E to add client A to the list of social network relationship Table 1. Identification information A is used to identify the sending party. Textual description may be something such as “request to join the social network relationship list 1,” for example. Identification information E is used to identify the receiving party. In this example, client E will receive the authentication request message which includes the identification of the sending party, client A, and textual description of “request to join the social network relationship list 1.”

Client E has direct social network relationships with client B, client C, and client D. If client B's social network relationship list includes client identification H, and client E's social network relationship list does not include client identification H, then client E and client H have a social network relationship, albeit not a direct social network relationship.

The social network server can be installed in any server in the social network, such as server 1, server 2, or server 3 in the social network. This server needs to be able to receive the authentication request message sent by client A through the network.

In the step 102, after receiving the authentication request message sent by client A, the social network server analyzes the authentication request message and obtains identification information E of the receiving party from the authentication request message. The social network server's database stores a Table 1′ with the same contents as Table 1. Based on Table 1′ that has the same contents as table 1 and is stored in the social network server, the social network server determines that clients who have direct social network relationships with client E are client B, client C, and client D. In this step, the social network server can search to obtain clients who have direct social network relationship with client E, which are client B, client C, and client D. It is understood that to further improve efficiency and to increase parameters relied on by the authentication message, the social network server, after obtaining the authentication request message sent by client A to establish the social network relationship with client E, can also obtain identification information A and identification information E. After receiving the authentication request message sent by the client with identification information A, the social network server analyzes the authentication request message, and obtains identification information A and identification information E from the authentication request message. Based on identification information A and identification information E, the social network server determines from multiple servers that a server storing an inverted index in which the keyword for storage index is (A-E), “AE”, “(AE)”, and so on to be server 1. The use of multiple servers is due to a scale of millions of users in the social network. Thus, this exemplary embodiment uses distributed servers to pre-store the inverted index. Of course, pre-storing inverted index is just a preferred implementation. This exemplary embodiment can also establish the inverted index after obtaining identification information A and E.

The inverted index is usually also referred to as reverse index, embedded file or inverted file, and is an indexing method generally used to store a mapping of a position (index field value) of a respective word (such as a keyword in index) stored in a file or a group of files in a full text search. The inverted index file in the present exemplary embodiment uses mutually bound identification information A and identification information E (where (A-E) represents the mutually bound identification information A and identification information E) as an index key. If the key is (A-E), it uses common social attribute information of clients, identification information A and identification information E, as an index value. The social attribute information shows an attribute of a social network user bound with a client in the social network.

The social attribute information can be registered by a user when the user joins the social network, such as for example: a location when the user registered the social network, the city of Hangzhou, and a company name, Company A. The social attribute information can also be information generated from an activity in the social network, such as for example: belonging to a group of World of Warcraft. The social attribute information can also be obtained, for example, from the user's logs, or from a database that stores the user registration information. Afterwards, common social attribute information can be obtained from the social attribute information of different users. In the above example, an index value may be {“Location”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male”, “Industry”→“electronics”, “Game Name”→“World of Warcraft”}. The inverted index file stored in server 1 is shown in Table 3 below.

TABLE 3 KEY VALUE (A-B) {“Location” → “Hangzhou”, “Company” → “Company A”, “Gender” → “male’, “Industry” → “electronics”, “Game Name” → “World of Warcraft”} (A-C) {“Location” → “Hangzhou”, “Company” → “Company A”, “Gender” → “male’, “Industry” → “electronics”, “Sports” → “soccer”} (A-D) {“Location” → “Hangzhou”, “Company” → “Company A”, “Gender” → “male’, “IP” → “196.168.0.*”, “Game Name” → “World of Warcraft”} (A-E) {“Location” → “Hangzhou”, “Company” → “Company A”, “Gender” → “male’, “Occupation” → “sales”, “Game Name” → “World of Warcraft”}

The social network server extracts identification information A and identification information E from the authentication request message to obtain (A-E). The social network server also identifies server 1, from among servers 1, 2, and 3 that store inverted indexes, as the server that stores the inverted index of which index keyword is (A-E). Alternatively, there may be only one server that stores the inverted index of which index keyword includes (A-E), “AE”, or “(AE),” which is server 1. The social network server then extracts an index record of which the keyword is (A-E), and the common social attribute information between client A and client E, from server 1. Specifically, the social network server extracts from Table 3 an index record of which the keyword is (A-E) and corresponding value (the common social attribute information between client A and client E) {“Location”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male', “Occupations”→“sales”, “Game Name”→“ World of Warcraft”}.

Furthermore, in order to increase efficiency and parameters relied on by the authentication request, the social network server can similarly extract from server 1 the index record of which keyword is (A-E) and a relationship chain information between client A and client E. The inverted index uses mutually bound identification information A and identification information E (where (A-E) represents the mutually bound identification information A and identification information E) as an index key, and the relationship chain information between client A and client E as an index value. The relationship chain information indicates there is indirect social network relationship between the two clients. For example, there is a certain social network relationship between the client of which identification information is A and the client of which identification information is B, in which the relationship category is 2. There is a certain social network relationship between client B and client E, in which the relationship category is 1. A value of an index with (A-E) being the key is {(A-B, relationship type 2), (B-E, relationship type 1)}. Likewise, there is a certain social network relationship between client A and client C, in which the relationship category is 2. There is a certain social network relationship between client C and client E, in which the relationship category is 1. Another value of the index with (A-E) being the key is {(A-C, relationship 2), (C-E, relationship 1)}. The inverted index file stored in server 1 is shown below in Table 4.

TABLE 4 Key VALUE (A-E) {(A-B, relationship type 2), (B-E, relationship type 1)}; {(A-C, relationship type 2), (C-E, relationship type 1)} (A-D) {(A-B, relationship type 2), (B-D, relationship type 1)};

Alternatively, based on identification information A and identification information E, the social network server identifies, from among the multiple servers that store inverted indexes, server 1 as the server that stores index record of which the keyword is A and server 2 as the server that stores index record of which the keyword is E. Of course, if the inverted index is stored in only one server, then there is no need to make such determination. For example, if all the index records are stored in server 1 of the social network, the index records regardless whether its keyword is A or E are extracted from server 1.

In this exemplary embodiment, the social network server extracts from server 1 the social attribute information of the client of which identification information is A from the index records of which the keyword is A, extracts from server 2 the social attribute information of the client of which identification information is E, and extracts a common social attribute information between the client of which identification information is A and the client of which identification information is E.

In this exemplary embodiment, the pre-stored inverted index uses each identification information as index key and social attribute information of respective client identification as a corresponding index value. For example, identification information A is used as key and the social attribute information of the client of which the identification information is A is used as the corresponding value. Identification information E is used as key and the social attribute information of the client of which the identification information is E is used as the corresponding value.

The value of index of which the key is identification information A is {“Location”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male”, “Industry”→“electronics”, “Game name”→“Warcraft World”, “Sports”→“soccer”, “Occupation”→“sales”, and etc.}. The value of index of which the key is identification information E is {“Location”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male”, “Industry”→“electronics”, “Game name”→“Warcraft World”, “Sports”→“table tennis”, “Occupation”→“financial officer”, and etc}. The social network server finds the common portions from the two values and that is {“Location”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male”, “Game name”→“Warcraft World”}.

In the step 103, after receiving the authentication request message sent by client A, the social network server analyzes the authentication request, extracts identification information A of the sending party from the authentication request message, and determines that client B and client C have direct social network relationship with client A based on client A's social network relationship list, shown in Table 5, that is stored in the social network server.

TABLE 5 Social Network Relationship Client identification Category B 1 C 1

In this step, the social network server can find the clients having direct social network relationship with client A from the pre-stored Table 5 in the database, which are client B and C. It can thus determine that clients having direct social network relationships with clients A and E are clients B and C. Client A and client E have a social network chain as shown in FIG. 2.

As a preferred embodiment, client B and client C have direct social network relationships with client A. At the same time, client B and client C also have direct social network relationships with client E. Certainly, it could be that client B and client C have direct social network relationships with client E while client B and client C have social network relationships instead of direct social network relationships with client A

In the step 104, the social network server automatically calculates a social network chain between client A and client E that has the highest total degree of familiarity. For example, a degree of familiarity of a social network chain client A→client B→client E is Y1+X1 and a degree of familiarity of another social network client A→client C→client E is Y2+X2. If Y1+X1>Y2+X2, then the social network server chooses client B from client B and client C, and obtains client B's identification information B. Otherwise, the social network server chooses client C. This present exemplary embodiment chooses client B as a preferred implementation. In this step, it uses a degree of familiarity to select client B or client C. Certainly the social network server can select either one of client B and client C without relying on the degree of familiarity.

Alternatively, the social network server chooses between client B and client C based on a number of client identifications in client B's social network relationship list and client C's social network relationship list. For example, the number of client identifications in client B's social network relationship list may be 10 while a number of client identifications in client C's social network relationship list may be 100. Because the number of client identifications in client B's social network relationship list is less than that of client C, it is probable that client B is more cautious in selecting his/her social network parties. Client B is thus chosen. Certainly, client B can also be chosen because client E accounts for 1/10 of client B's social network relationship list while client E accounts for 1/100 of client C's social network relationship list. Certainly the social network server can establish a threshold such as 1/20. Client B is chosen because client E accounts for 1/10 of client B's social network relationship list, a percentage that is higher than the threshold of 1/20, while client E accounts for 1/100 of client C's social network relationship list, a percentage that is lower than the threshold of 1/20.

Alternatively, the social network server automatically chooses one between client B and client C that has a higher degree of familiarity with client E: If X1>X2, then the social network server chooses client B; otherwise chooses client C. For illustrative purpose, this exemplary embodiment uses client B as the preferred implementation.

Certainly, in addition to using preset rules to choose client B as described with respect to the step 104, the social network server can also send the identification information B and C of clients B and C, respectively, to client A. If client A chooses C then the social network server chooses client C based on client A's choice. Otherwise, if client A chooses B then the social network server chooses client B based on client A's choice.

The degree of familiarity can be obtained as follows. Suppose that a time during which two clients have the social network relationship is N (e.g. 30 days), a corresponding value of degree of familiarity for a standard unit time (e.g. 1 day) is M, a time weighted value of degree of familiarity is N*M. Moreover, suppose that a degree of familiarity value of two clients exchanging information once within the standard unit time is P, a maximum value of degree of familiarity of two clients exchanging information within the standard unit time is Pmax, where Pmax<P*Y, with Y being a maximum number of times that two clients exchange information within the standard unit time. For example, assuming that the standard unit time is 1 day, and there are 90 instances of information exchange in the standard unit time, then Pmax=90P.) Therefore, a degree of familiarity between the two clients can be calculated as: X1=N1*M1+Min(Y*P, Pmax).

In the step 105, after the social network server receives the authentication request message sent by client A, the social network server searches identification information A in the authentication request message and modifies it to identification information B. The modified authentication request message includes: identification information B and some modified textual description. Identification information B is used to identify a sending party of the modified authentication request message. The modified textual description can be, for example: “client A requests to join the social relationship list 1”. Thus, the modified authentication request message includes the following indication: client identification of the sending party=B and textual description=“client A requests to be included in the social relationship list 1.”

In the step 106, the social network server sends to client E the authentication request message with modified identification information, including identification information B and some textual description in the authentication request message originally sent by client A to request client E to add client A to the social network relation list 1. If the social network server selects client B according to the preset rules, the social network server can first send to client B the authentication request message with the modified identification information. The social network server, after receiving OK confirmation information replied by client B, sends to client E the authentication request message with modified identification information. Otherwise, the social network server does not send to client E the authentication request message with the modified identification information.

Furthermore, if in the step 102 the social network server extracts the common social attribute information between client A and client E, then the social network server obtains the mutually bound (A-E) based on the received identification information A and identification information E in the authentication request message sent by client A, and the common social attribute information between client A and client E from Table 3. The authentication request message sent by the social network server to client E includes the common social attribute information between client A and client E. The social network server sends to client E the extracted {“Location”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male′, “Profession”→“sales”, “Game Name”→“World of Warcraft”}. Through {“Location”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male′, “Profession”→“Sales”, “Game Name”→“World of Warcraft”}, it shows that the user bound with client A and the user bounded with client E have common attribute information in the social network.

At the same time, the social network server forwards the authentication request message to client E. The authentication request message carries the common social attribute information {“Location”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male′, “Profession”→“sales”, “Game Name”→“World of Warcraft”} in the authentication request message. Certainly the social network server can send to client E the authentication request message and the common social attribute information separately. The authentication request message and the common social attribute information carry information that they are bound with each other so that the client of which identification information is E can know to which authentication request message the received common social attribute information corresponds, and authenticates the authentication request message according to this common social attribute information. Client E will display the received common social attribute information between client A and E. Client E can use a form of social relationship authentication message box to receive the authentication request message sent by client A to request to establish the social relationship, and display it in the social relationship authentication message box.

If in the step 102 the social network server extracts the social relationship chain information between client A and client E, then the social network server obtains the mutually bound (A-E) based on the received identification information A and identification information E in the authentication request message sent by client A, and the social relationship chain information between client A and client E from Table 4. The authentication request message sent by the social network server to client E includes the extracted {(A-B, relationship type 2), (B-E, relationship type 1)}; {(A-C, relationship type 2), (C-E, relationship type 1)}. Client E displays the received social relationship chain between client A and client E. Client E can use a form of social relationship authentication message box to receive the authentication request message sent by client A to request to establish the social relationship, and display it in the social relationship authentication message box.

As an alternative, in the step 103, after determining that client B and client C are clients having direct social network with client A, the social network server can directly modify identification information A of the authentication request message sent by client A into identification information B and identification information C without choosing between client B and client C. The modified authentication request message includes the following indication: sending party identification=B and C, textual description=“client A requests to join the social network relationship list 1.”

The system can also automatically determine and extract a number of pieces of common social attribute information. If the number is 10, which is just beyond a set first threshold 9, the system will automatically add user A into user B's social network relationship list 1. If the number is 5, which is just beyond a set second threshold 4, then the system will automatically add user A into user B's social network relationship list 2.

A second exemplary embodiment provided by the present disclosure is an apparatus 200 for sending an authentication request message in a social network. The structure of the apparatus 200 is shown in FIG. 3. Components of the apparatus 200 are described below.

A receiving Module 201 receives a first authentication request message sent by a first client to request to establish a social network relationship with a second client. The first authentication request message includes identification information of the first client.

A modification module 202 modifies the first client identification information to a third client identification information to obtain a second authentication request message. The third client has a social network relationship with the first client and also has a direct social network relationship with the second client.

A first sending module 203 sends the second authentication request message to the second client.

Furthermore, the apparatus 200 also includes a determination module 204 that determines a third client, according to a degree of familiarity with the second client, from clients having a social network relationship with the first client and a direct social network relationship with the second client.

Furthermore, the determination module 204 also determines the third client, according to a degree of familiarity with the first client and a degree of familiarity with the second client, from clients having a direct social network relationship with the first client and a direct social network relationship with the second client.

Furthermore, the determination module 204 also determines the third client that has a maximum degree of familiarity with the second client from clients having a social network relationship with the first client.

Furthermore, the apparatus 200 includes a second sending module 205 that sends to the first client with identification information of all clients having social network relationship with the first client and direct social relation with the second client.

The determination module 204 is also configured to determine the third client according to selection information of the first client.

Furthermore, the apparatus 200 includes a third sending module 206 that sends to the third client the second authentication request message.

The first sending module 203 is also configured to send the second authentication request message to the second client after receiving the third client's responding confirmation message.

A person of ordinary skill in the art can alter or modify the present disclosure in many different ways without departing from the spirit and the scope of this disclosure. Accordingly, if any modifications and variations of the present disclosure fall within the scope of the claims of the present disclosure and its equivalents, the present disclosure includes such modifications and alterations. 

1.-15. (canceled)
 16. A computer-implemented method for establishing connections, the method comprising: receiving, at a computing device including one or more processors and from a user device of a first user, a request for a connection with a second user; determining, using the computing device and based on the request, a third user that has a direct connection with the first user and the second user within a social network; providing, using the computing device, a notification associated with the request to the third user; and in response to a confirmation of the notification, providing, by the computing device, an additional request for acceptance of the connection from the second user.
 17. The computer-implemented method of claim 16, further comprising: in response to an acceptance from the second user, causing the connection established between the first user and the second user.
 18. The computer-implemented method of claim 16, wherein the request including identification information of the first user and the second user.
 19. The computer-implemented method of claim 16, wherein the providing the notification associated with the request to the third user comprises providing the notification to indicate that the first user requests the connection with the second user using identification information associated with the third user.
 20. The computer-implemented method of claim 16, wherein the providing the additional request for the acceptance from the second user comprises modifying the request to generate the additional request that includes identification information associated with the third user.
 21. The computer-implemented method of claim 20, wherein the additional request further includes common social attribute information the first user and the second user within the social network.
 22. The computer-implemented method of claim 20, wherein the additional request further includes one or more common user of the first user and the second user within the social network and relationship categories of the one or more common user.
 23. The computer-implemented method of claim 16, wherein the determining the third user comprises: determining one or more users that have direct connections with the first user and the second user; and determining, among the one or more users, the third user based on at least one of a social network chain between the first user and the second user, a degree of familiarity of the third user and the first user, a degree of familiarity of the third user and the second user, or numbers of connections of the one or more users within the social network.
 24. The computer-implemented method of claim 16, wherein the determining the third user comprises: determining one or more users that have direct connections with the first user and the second user; and determining, among the one or more users, the third user based on a degree of familiarity of the third user and the first user.
 25. The computer-implemented method of claim 24, wherein the degree of familiarity of the third user and the first user is calculated based on a time period during which the third user and the first user have a connection within the social network and a number of times that the third user and the first user exchange messages during a certain time period within the social network.
 26. A system comprising: one or more processors; and memory to maintain a plurality of components executable by the one or more processors, the plurality of components comprising: a receiving module configured to receive, from a user device of a first user, a request for establishment of a social connection with a second user, a modification module configured to determine, based on the request, a third user that has a certain social connection with the first user and the second user, a third sending module configured to provide a notification associated with the request to the third user, and a first sending module configured to, in response to a confirmation of the notification, provide an additional request for acceptance of the social connection from the second user.
 27. The system of claim 26, wherein the request including identification information of the first user and the second user.
 28. The system of claim 26, wherein the third user has a direct social connection with the first user and the second user, the providing the notification associated with the request to the third user comprises providing the notification to indicate that the first user requests the connection with the second user using identification information associated with the third user, and the providing the additional request for the acceptance from the second user comprises modifying the request to generate the additional request that includes identification information associated with the third user.
 29. The system of claim 26, wherein the determining the third user comprises: determining one or more users that have direct connections with the first user and the second user; and determining, among the one or more users, the third user based on a degree of familiarity of the third user and the first user.
 30. The system of claim 29, wherein the degree of familiarity of the third user and the first user is calculated based on a time period during which the third user and the first user have a connection within a social network and a number of times that the third user and the first user exchange messages during a certain time period within the social network.
 31. Non-transitory server memory storing computer-executable instructions that, when executed by one or more processors, instruct the one or more processors to perform acts comprising: receiving, from a user device of a first user, a request for a connection with a second user; determining, based on the request, a third user that has a connection with the first user and the second user within a social network; providing a notification indicating that the first user requests the connection with the second user using identification information associated with the third user; and in response to a confirmation of the notification, providing an additional request for acceptance of the connection from the second user.
 32. The non-transitory server memory of claim 31, wherein the acts further comprise, in response to the acceptance from the second user, causing the connection established between the first user and the second user.
 33. The non-transitory server memory of claim 31, wherein the request including identification information of the first user and the second user, and the determining, based on the request, the third user that has the connection with the first user and the second user within the social network comprises: determining, based on the identification information of the first user and the second user, one or more users that have direct connections with the first user and the second user; and determining, among the one or more users, the third user based on at least one of a social network chain between the first user and the second user, a degree of familiarity of the third user and the first user, a degree of familiarity of the third user and the second user, or numbers of connections of the one or more users within the social network.
 34. The non-transitory server memory of claim 31, wherein the providing the additional request for the acceptance from the second user comprises modifying the request to generate the additional request that includes identification information associated with the third user.
 35. The non-transitory server memory of claim 34, wherein the additional request further includes common social attribute information the first user and the second user within the social network. 